Statistical assessment of MMSE scores
نویسندگان
چکیده
منابع مشابه
Cut-off scores in MMSE: a moving target?
BACKGROUND Cognitive tests are known to be influenced by language, culture and education. In addition, there may be an impact of 'epoch' in cognition, because there is secular increase in scores of IQ tests in children. If we assume this is a long lasting process, then it should persist later in life. METHODS To test this hypothesis, we compared the performance of two cohorts of individuals (...
متن کاملCOMPASS: A computational model to predict changes in MMSE scores 24-months after initial assessment of Alzheimer’s disease
We present COMPASS, a COmputational Model to Predict the development of Alzheimer's diSease Spectrum, to model Alzheimer's disease (AD) progression. This was the best-performing method in recent crowdsourcing benchmark study, DREAM Alzheimer's Disease Big Data challenge to predict changes in Mini-Mental State Examination (MMSE) scores over 24-months using standardized data. In the present study...
متن کاملassessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
Max-plus statistical leverage scores
The statistical leverage scores of a complex matrix A ∈ Cn×d record the degree of alignment between col(A) and the coordinate axes in Cn. These score are used in random sampling algorithms for solving certain numerical linear algebra problems. In this paper we present a max-plus algebraic analogue for statistical leverage scores. We show that max-plus statistical leverage scores can be used to ...
متن کاملStatistical Significance of Tree Similarity Scores
New methodologies for performing pairwise tree-matching on carbohydrate sugar chain data were introduced in [3], in which well-known sequence alignment algorithms [12] were extended and an already known polynomial-time graph algorithm for finding the maximum common subtree (MCST) of two trees [7] was used to implement what is called the KEGG Carbohydrate Matcher, or KCaM. These new methodologie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Psychiatric Bulletin
سال: 2006
ISSN: 0955-6036,1472-1473
DOI: 10.1192/pb.30.9.354-b